On calculational proofs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On calculational proofs

This note is about the \calculational style" of presenting proofs introduced by Dijkstra and Scholten and adopted in some books on theoretical computer science. We deene the concept of a calculation, which is a formal counterpart of the idea of a calculational proof. The deenition is in terms of a new formalization DS of predicate logic. Any proof tree in the system DS can be represented as a s...

متن کامل

Teaching Math More Effectively, Through Calculational Proofs

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected].. Mathematical Association of America is collaborating with...

متن کامل

Calculational Relation-Algebraic Proofs in Isabelle/Isar

We propose a collection of theories in the proof assistant Isabelle/Isar that support calculational reasoning in and about heterogeneous relational algebras and Kleene algebras.

متن کامل

Adapting Calculational Logic to the Undefined

Programming abounds with partial functions. Some functions are inherently partial (e.g. division and referring to the first element of a list). Other functions are partial according to their recursive definitions. If partial functions are admitted in formulae, a programming logic is needed that handles partial functions and undefined terms. Dijkstra and Scholten [1], Gries and Schneider [2], Fe...

متن کامل

Mechanically Verified Calculational Abstract Interpretation

Calculational abstract interpretation, long advocated by Cousot, is a technique for deriving correct-by-construction abstract interpreters from the formal semantics of programming languages. This paper addresses the problem of deriving correct-by-verifiedconstruction abstract interpreters with the use of a proof assistant. We identify several technical challenges to overcome with the aim of sup...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 2001

ISSN: 0168-0072

DOI: 10.1016/s0168-0072(01)00059-8